Spectral densities of scale-free networks.
نویسندگان
چکیده
The spectral densities of the weighted Laplacian, random walk, and weighted adjacency matrices associated with a random complex network are studied using the replica method. The link weights are parametrized by a weight exponent beta. Explicit results are obtained for scale-free networks in the limit of large mean degree after the thermodynamic limit, for arbitrary degree exponent and beta.
منابع مشابه
Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of Scale Free Networks and Small World Networks
In this paper, we show the evaluation of the spectral radius for node degree as the basis to analyze the variation in the node degrees during the evolution of scale-free networks and small-world networks. Spectral radius is the principal eigenvalue of the adjacency matrix of a network graph and spectral radius ratio for node degree is the ratio of the spectral radius and the average node degree...
متن کاملStochasticity in Complex Networks: A random matrix analysis
Following random matrix theory, we study nearest neighbor spacing distribution (NNSD) of the eigenvalues of the adjacency matrix of various model networks, namely scale-free, small-world and random networks. Our analysis shows that, though spectral densities of these model networks are different, their eigenvalue fluctuations are same and follow Gaussian orthogonal ensemble (GOE) statistics. Se...
متن کاملSpectral Density of Complex Networks with a Finite Mean Degree
In order to clarify the statistical features of complex networks, the spectral density of adjacency matrices has often been investigated. Adopting a static model introduced by Goh, Kahng and Kim, we analyse the spectral density of complex scale free networks. For that purpose, we utilize the replica method and effective medium approximation (EMA) in statistical mechanics. As a result, we identi...
متن کاملOrigin of the hub spectral dimension in scale-free networks.
The return-to-origin probability and the first-passage-time distribution are essential quantities for understanding transport phenomena in diverse systems. The behaviors of these quantities typically depend on the spectral dimension d(s). However, it was recently revealed that in scale-free networks these quantities show a crossover between two power-law regimes characterized by d(s) and the so...
متن کاملSpectral dimensions of hierarchical scale-free networks with weighted shortcuts.
Spectral dimensions have been widely used to understand transport properties on regular and fractal lattices. However, they have received little attention with regard to complex networks such as scale-free and small-world networks. Here, we study the spectral dimension and the return-to-origin probability of random walks on hierarchical scale-free networks, which can be either fractal or nonfra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Chaos
دوره 17 2 شماره
صفحات -
تاریخ انتشار 2007